An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion

In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M = {(s1, t1), . . . , (sk, tk)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion the number of paths sharing any edge is bounded by c. When the maximum allowed congestion is c ...

Analysis of an ( )-Approximation Algorithm for the Maximum Edge-Disjoint Paths Problem with Congestion Two

The edge-disjoint paths problem (EDPP) has been studied for a long time by graph theorists and algorithm developers for combinatorial optimization. In its most basic form, the EDPP is as follows: given a graph and a set of pairs of vertices/terminals for in decide whether or not has edge-disjoint paths connecting the given pairs of terminals. This problem is equivalent to finding vertex-disjoin...

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edge-disjoint paths. We give a survey of known results about the complexity and approximability of MEDP and sketch some of the main ideas that have been used to obtain approximation algorithms for the problem. We...

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs

In th i s paper we discuss the problem of f inding edge-disjoint pa th s in a p lanar , und i rec ted g raph such t h a t each p a t h connec ts two specified vert ices on the b o u n d a r y of the g raph . We will focus on t he "classical" case where an ins tance addi t ional ly fulfills t he so-called evenness-condition. T h e fas tes t a lgor i thm for this p rob lem known from the l i te r...

An Approximation Algorithm for Maximum Packing of 3-Edge Paths